Convex mixed integer nonlinear programming problems and an outer approximation algorithm
نویسندگان
چکیده
منابع مشابه
Quadratic Outer Approximation for Convex Integer Programming
We present a quadratic outer approximation scheme for solving general convex integer programs, where suitable quadratic approximations are used to underestimate the objective function instead of classical linear approximations. As a resulting surrogate problem we consider the problem of minimizing a function given as the maximum of finitely many convex quadratic functions having the same Hessia...
متن کاملA hybrid algorithm between branch-and-bound and outer approximation for Mixed Integer Nonlinear Programming
In this work, we present a new hybrid algorithm for convex Mixed Integer Nonlinear Programming combining branch-and-bound and outer approximation algorithms in an e ective and e cient way.
متن کاملUsing Interior-point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming
Interior-point methods for nonlinear programming have been demonstrated to be quite efficient, especially for large scale problems, and, as such, they are ideal candidates for solving the nonlinear subproblems that arise in the solution of mixed-integer nonlinear programming problems via outer approximation. However, traditionally, infeasible primal-dual interior-point methods have had two main...
متن کاملOverview on Mixed Integer Nonlinear Programming Problems
Many optimization problems involve integer and continuous variables that can be modeled as mixed integer nonlinear programming (MINLP) problems. This has led to a wide range of applications, in particular in some engineering areas. Here, we provide a brief overview on MINLP, and present a simple idea for a future nonconvex MINLP solution technique.
متن کاملAn Improved Approach For Solving Mixed-Integer Nonlinear Programming Problems
This special class of a nonlinear mathematical programming problem which is addressed in this paper has a structure characterized by a subset of variables restricted to assume discrete values, which are linear and separable from the continuous variables. The strategy of releasing nonbasic variables from their bounds, combined with the “active constraint” method and the notion of superbasics, ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2015
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-015-0284-5